//输入一个链表的头节点，从尾到头反过来返回每个节点的值（用数组返回）。 
//
// 
//
// 示例 1： 
//
// 输入：head = [1,3,2]
//输出：[2,3,1] 
//
// 
//
// 限制： 
//
// 0 <= 链表长度 <= 10000 
// Related Topics 链表 
// 👍 74 👎 0

package leetcode.editor.cn;

import java.util.Stack;

//Java：从尾到头打印链表
public class CongWeiDaoTouDaYinLianBiaoLcof{
    public static void main(String[] args) {
        Solution solution = new CongWeiDaoTouDaYinLianBiaoLcof().new Solution();
        
    }

    class ListNode {
        int val;
        ListNode next;
        ListNode(int x) { val = x; }
    }
    //leetcode submit region begin(Prohibit modification and deletion)
/**
 * Definition for singly-linked list.
  public class ListNode {
      int val;
      ListNode next;
      ListNode(int x) { val = x; }
  }
 */
class Solution {
    public int[] reversePrint(ListNode head) {
        Stack stack = new Stack();
        while( head != null ){
            stack.push( head.val );
            head = head.next;
        }
        int stack_size = stack.size();
        int[] answerInts = new int[stack_size];
        for (int i = 0; i < stack_size; i++) {
            answerInts[i] = (int) stack.pop();
        }
        return answerInts;
    }
}
//leetcode submit region end(Prohibit modification and deletion)

}
